this is in increasing order of computation complexity 这也是在增加计算复杂性的顺序。
compare of computation complexity between this method and 2d-fft is done 比较了该方法与2d-fft方法的计算量差别。
in order to reduce the computation complexity of the error-tolerant algorithm, two fast algorithms are proposed 为了解决容错算法的计算量问题,本文提出了两种快速算法。
however, these heuristic algorithms have high computation complexity so they are not fit in practicality 然而由于这些算法都具有较高的时间复杂度而不能满足实际应用的需要。
so the parameters are constrained and derived step by step . then the reliability is improved while computation complexity is decreased 求解时,对所求参数分步约束进行求解,提高了算法的稳定性并减少了计算量。